ar X iv : c s / 06 07 10 9 v 1 [ cs . D M ] 2 5 Ju l 2 00 6 Complexity and Applications of Edge - Induced Vertex - Cuts

نویسنده

  • Stefan Szeider
چکیده

Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : h ep - p h / 06 07 13 9 v 1 1 2 Ju l 2 00 6 IPPP /

We use twistor inspired rules to compute the one-loop amplitude for a Higgs boson coupling to any number of negative helicity gluons in the large top mass limit.

متن کامل

ar X iv : h ep - p h / 06 07 13 9 v 2 1 8 Ju l 2 00 6 IPPP

We use twistor inspired rules to compute the one-loop amplitude for a Higgs boson coupling to any number of negative helicity gluons in the large top mass limit.

متن کامل

ar X iv : c s / 06 05 08 5 v 1 [ cs . L O ] 1 9 M ay 2 00 6 A Scalable Algorithm for Minimal Unsatisfiable Core Extraction ⋆

We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds smaller cores than suboptimal algorithms; and that it runs faster than those algorithms that guarantee minimality of the core. (A more complete version of thi...

متن کامل

ar X iv : c s / 04 05 05 9 v 3 [ cs . D M ] 1 5 D ec 2 00 5 A linear algorithm to find a strong stable set in a Meyniel graph ∗

A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. A strong stable set of a graph G is a stable set that intersects all maximal cliques of G. We present a linear-time algorithm that, for any vertex of a Meyniel graph, find a strong stable set containing this vertex.

متن کامل

ar X iv : h ep - t h / 06 12 03 5 v 2 1 1 D ec 2 00 6 Dark energy induced by neutrino mixing

The energy content of the vacuum condensate induced by the neutrino mixing is interpreted as dynamically evolving dark energy.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006